Information Theoretic Criteria for Community Detection
نویسنده
چکیده
Many algorithms for finding community structure in graphs search for a partition that maximizes modularity. However, recent work has identified two important limitations of modularity as a community quality criterion: a resolution limit; and a bias towards finding equal-sized communities. Information-theoretic approaches that search for partitions that minimize description length are a recent alternative to modularity. This paper shows that two information-theoretic algorithms are themselves subject to a resolution limit, identifies the component of each approach that is responsible for the resolution limit, proposes a variant, SGE (Sparse Graph Encoding), that addresses this limitation, and demonstrates on three artificial data sets that (1) SGE does not exhibit a resolution limit on sparse graphs in which other approaches do, and that (2) modularity and the compression-based algorithms, including SGE, behave similarly on graphs not subject to the resolution limit.
منابع مشابه
Overlapping Community Detection in Social Networks Based on Stochastic Simulation
Community detection is a task of fundamental importance in social network analysis. Community structures enable us to discover the hidden interactions among the network entities and summarize the network information that can be applied in many applied domains such as bioinformatics, finance, e-commerce and forensic science. There exist a variety of methods for community detection based on diffe...
متن کاملSVD-based information theoretic criteria for detection of the number of damped/undamped sinusoids and their performance analysis
Recently, Wax and Kailath developed information theoretic criteria for detection of the number of signals received by a sensor array. More recently, Fuchs developed a criterion, based on the perturbation analysis of the data autocorrelation matrix, for detecting the number of sinusoids. In this paper, following the information theoretic approach to model selection, we first develop criteria for...
متن کاملInformation-theoretic thresholds for community detection in sparse networks
We give upper and lower bounds on the information-theoretic threshold for community detection in the stochastic block model. Specifically, let k be the number of groups, d be the average degree, the probability of edges between vertices within and between groups be cin/n and cout/n respectively, and let λ = (cin − cout)/(kd). We show that, when k is large, and λ = O(1/k), the critical value of ...
متن کاملAn Optimized Firefly Algorithm based on Cellular Learning Automata for Community Detection in Social Networks
The structure of the community is one of the important features of social networks. A community is a sub graph which nodes have a lot of connections to nodes of inside the community and have very few connections to nodes of outside the community. The objective of community detection is to separate groups or communities that are linked more closely. In fact, community detection is the clustering...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008